An evaluation of bipartitioning techniques
نویسندگان
چکیده
Logic partitioning is an important issue in VLSI CAD, and has been an active area of research for at least the last 25 years. Numerous approaches have been developed and many different techniques have been combined for a wide range of applications. In this paper, we examine many of the existing techniques for logic bipartitioning and present a methodology for determining the best mix of approaches. The result is a novel bipartitioning algorithm that includes both new and pre-existing techniques. Our algorithm produces results that are at least 17% better than the state-of-the-art while also being efficient in run time.
منابع مشابه
An Evaluation of Bipartitioning Techniques - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Logic partitioning is an important issue in VLSI CAD, and has been an area of active research for at least the last 25 years. Numerous approaches have been developed and many different techniques have been combined for a wide range of applications. In this paper, we examine many of the existing techniques for logic bipartitioning and present a methodology for determining the best mix of approac...
متن کاملk-way Hypergraph Partitioning via n-Level Recursive Bisection
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time. Using several caching and lazy-evaluation techniques during coarsening and refinement, we reduce the running time by up to two-orders of magnitude compared to a naive n-level algorithm that would be adequate for ordinary graph partitioning. The overall performance is even better than the wid...
متن کاملReplicated partitioning for undirected hypergraphs
Hypergraph partitioning (HP) and replication are diverse but powerful tools that are traditionally applied separately to minimize the costs of parallel and sequential systems that access related data or process related tasks. When combined together, these two techniques have the potential of achieving significant improvements in performance of many applications. In this study, we provide an app...
متن کاملA Design Methodology for Three - dimensional Space - invariant Hypercube Networks Using Graph Bipartitioning
We present a new design methodology for constructing three-dimensional space-invariant hypercube interconnection networks. The methodology is based on a graph bipartitioning technique and allows the construction of larger hypercube networks from smaller networks in a systematic and incremental fashion. Due to its totally space-invariant nature, the resulting three-dimensional hypercube networks...
متن کاملEfficient Network Flow Based Min-Cut Balanced Partitioning - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
We consider the problem of bipartitioning a circuit into two balanced components that minimizes the number of crossing nets. Previously, Kernighan and Lin type (K&L) heuristics, simulated annealing approach, and analytical methods were given to solve the problem. However, network flow (maxflow min-cut) techniques were overlooked as viable heuristics to min-cut balanced bipartition due to their ...
متن کامل